Fundamental matrix estimation: A study of error criteria
نویسندگان
چکیده
The fundamental matrix (FM) describes the geometric relations that exist between two images of the same scene. Different error criteria are used for estimating FMs from an input set of correspondences. In this paper, the accuracy and efficiency aspects of the different error criteria were studied. We mathematically and experimentally proved that the most popular error criterion, the symmetric epipolar distance, is biased. It was also shown that despite the similarity between the algebraic expressions of the symmetric epipolar distance and Sampson distance, they have different accuracy properties. In addition, a new error criterion, Kanatani distance, was proposed and was proved to be the most effective for use during the outlier removal phase from accuracy and efficiency perspectives. To thoroughly test the accuracy of the different error criteria, we proposed a randomized algorithm for Reprojection Error-based Correspondence Generation (RECG). As input, RE-CG takes an FM and a desired reprojection error value d. As output, RE-CG generates a random correspondence having that error value. Mathematical analysis of this algorithm revealed that the success probability for any given trial is 1− (2/3) at best and is 1− (6/7) at worst while experiments demonstrated that the algorithm often succeeds after only one trial.
منابع مشابه
Bernoulli matrix approach for matrix differential models of first-order
The current paper contributes a novel framework for solving a class of linear matrix differential equations. To do so, the operational matrix of the derivative based on the shifted Bernoulli polynomials together with the collocation method are exploited to reduce the main problem to system of linear matrix equations. An error estimation of presented method is provided. Numerical experiments are...
متن کاملOn the Estimation of the Fundamental Matrix: A Convex Approach to Constrained Least-Squares
In this paper we consider the problem of estimating the fundamental matrix from point correspondences. It is well known that the most accurate estimates of this matrix are obtained by criteria minimizing geometric errors when the data are aaected by noise. It is also well known that these criteria amount to solving non-convex optimization problems and, hence, their solution is aaected by the op...
متن کاملApplication of fractional-order Bernoulli functions for solving fractional Riccati differential equation
In this paper, a new numerical method for solving the fractional Riccati differential equation is presented. The fractional derivatives are described in the Caputo sense. The method is based upon fractional-order Bernoulli functions approximations. First, the fractional-order Bernoulli functions and their properties are presented. Then, an operational matrix of fractional order integration...
متن کاملEstimating the Fundamental Matrix via Constrained Least-Squares: A Convex Approach
ÐIn this paper, a new method for the estimation of the fundamental matrix from point correspondences is presented. The minimization of the algebraic error is performed while taking explicitly into account the rank-two constraint on the fundamental matrix. It is shown how this nonconvex optimization problem can be solved avoiding local minima by using recently developed convexification technique...
متن کاملSubspace Methods and Equilibration in Computer Vision
Many computer vision problems (e.g. the estimation of the fundamental matrix, the homography matrix, or camera calibration as well as the factorization method) belong to the class of subspace problems which are well-known in signal processing. They essentially consist in dividing a vector space into a lower dimensional data space and an orthogonal error space, based on the information available...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Pattern Recognition Letters
دوره 32 شماره
صفحات -
تاریخ انتشار 2011